SUSY transfer matrix approach for the real symmetric 1d random band matrices

نویسندگان

چکیده

This paper adapts the recently developed rigorous application of supersymmetric transfer matrix approach for Hermitian 1d band matrices to case orthogonal symmetry. We consider N×N block consisting W×W random Gaussian blocks (parametrized by j,k∈Λ=[1,n]∩Z, N=nW) with a fixed entry’s variance Jjk=W−1(δj,k+βΔj,k) in each block. Considering limit W,n→∞, we prove that behaviour second correlation function characteristic polynomials such bulk spectrum exhibit crossover near threshold W∼ N.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characteristic polynomials of real symmetric random matrices

It is shown that the correlation functions of the random variables det(λ−X), in which X is a real symmetric N × N random matrix, exhibit universal local statistics in the large N limit. The derivation relies on an exact dual representation of the problem: the k-point functions are expressed in terms of finite integrals over (quaternionic) k × k matrices. However the control of the Dyson limit, ...

متن کامل

Real symmetric random matrices and path counting.

Exact evaluation of (TrS(p)) is here performed for real symmetric matrices S of arbitrary order n , up to some integer p , where the matrix entries are independent identically distributed random variables, with an arbitrary probability distribution. These expectations are polynomials in the moments of the matrix entries; they provide useful information on the spectral density of the ensemble in...

متن کامل

Real symmetric random matrices and replicas.

Various ensembles of random matrices with independent entries are analyzed by the replica formalism in the large- N limit. A result on the Laplacian random matrix with Wigner-rescaling is generalized to arbitrary probability distribution.

متن کامل

Comparison of eigensolvers for symmetric band matrices

We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as implemented in Lapack or Plasma on the one hand, and the block divide-and-conquer (BD&C) algorithm as well as the block twisted factorization (BTF) meth...

متن کامل

DDtBe for Band Symmetric Positive Definite Matrices

We present a new parallel factorization for band symmetric positive definite (s.p.d) matrices and show some of its applications. Let A be a band s.p.d matrix of order n and half bandwidth m. We show how to factor A as A =DDt Be using approximately 4nm2 jp parallel operations where p =21: is the number of processors. Having this factorization, we improve the time to solve Ax = b by a factor of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2022

ISSN: ['1083-6489']

DOI: https://doi.org/10.1214/22-ejp747